Combinatorial GVNS (General Variable Neighborhood Search) Optimization for Dynamic Garbage Collection
نویسندگان
چکیده
منابع مشابه
Quantum Inspired General Variable Neighborhood Search (qGVNS) for dynamic garbage collection
General Variable Neighborhood Search (GVNS) is a well known and widely used 1 metaheuristic for efficiently solving many NP-hard combinatorial optimization problems. Quantum 2 General Variable Neighborhood Search (qGVNS) is a novel, quantum inspired extension of the 3 conventional GVNS. Its quantum nature derives from the fact that it takes advantage and incorporates 4 tools and techniques from...
متن کاملGeneral variable neighborhood search for the continuous optimization
We suggest a new heuristic for solving unconstrained continuous optimization problems. It is based on a generalized version of the variable neighborhood search metaheuristic. Different neighborhoods and distributions, induced from different metrics are ranked and used to get random points in the shaking step. We also propose VNS for solving constrained optimization problems. The constraints are...
متن کاملConsistent Neighborhood Search for Combinatorial Optimization
Many optimization problems (from academia or industry) require the use of a local search to find a satisfying solution in a reasonable amount of time, even if the optimality is not guaranteed. Usually, local search algorithms operate in a search space which contains complete solutions (feasible or not) to the problem. In contrast, in Consistent Neighborhood Search (CNS), after each variable ass...
متن کاملoptimization of high-performance concrete structures by variable neighborhood search
this paper describes a methodology in designing high-performance concrete for simply supported beams, using a hybrid optimization strategy based on a variable neighborhood search threshold acceptance algorithm. three strategies have been applied to discrete optimization of reinforced concrete beams: variable neighborhood descent (vnd), reduced neighborhood search (rns) and basic variable neighb...
متن کاملWinner Determination in Combinatorial Auctions using Hybrid Ant Colony Optimization and Multi-Neighborhood Local Search
A combinatorial auction is an auction where the bidders have the choice to bid on bundles of items. The WDP in combinatorial auctions is the problem of finding winning bids that maximize the auctioneer’s revenue under the constraint that each item can be allocated to at most one bidder. The WDP is known as an NP-hard problem with practical applications like electronic commerce, production manag...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithms
سال: 2018
ISSN: 1999-4893
DOI: 10.3390/a11040038